Low-rank statistical finite elements for scalable model-data synthesis
نویسندگان
چکیده
Statistical learning additions to physically derived mathematical models are gaining traction in the literature. A recent approach has been augment underlying physics of governing equations with data driven Bayesian statistical methodology. Coined statFEM, method acknowledges a priori model misspecification, by embedding stochastic forcing within equations. Upon receipt additional data, posterior distribution discretised finite element solution is updated using classical filtering techniques. The resultant jointly quantifies uncertainty associated ubiquitous problem misspecification and intended represent true process interest. Despite this appeal, computational scalability challenge statFEM's application high-dimensional problems typically experienced physical industrial contexts. This article overcomes hurdle low-rank approximation dense covariance matrix, obtained from leading order modes full-rank alternative. Demonstrated on series reaction-diffusion increasing dimension, experimental simulated reconstructs sparsely observed data-generating processes minimal loss information, both mean variance, paving way for further integration probabilistic approaches complex systems.
منابع مشابه
Rank Determination for Low-Rank Data Completion
Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we aim to approximate the unknown rank based on the location of sampled entries and some given completion. We consider a number of data models, including singl...
متن کاملActive Subspace: Toward Scalable Low-Rank Learning
We address the scalability issues in low-rank matrix learning problems. Usually these problems resort to solving nuclear norm regularized optimization problems (NNROPs), which often suffer from high computational complexities if based on existing solvers, especially in large-scale settings. Based on the fact that the optimal solution matrix to an NNROP is often low rank, we revisit the classic ...
متن کاملScalable and Sound Low-Rank Tensor Learning
Many real-world data arise naturally as tensors. Equipped with a low rank prior, learning algorithms can benefit from exploiting the rich dependency encoded in a tensor. Despite its prevalence in low-rank matrix learning, trace norm ceases to be tractable in tensors and therefore most existing works resort to matrix unfolding. Although some theoretical guarantees are available, these approaches...
متن کاملLow-Rank Time-Frequency Synthesis
Many single-channel signal decomposition techniques rely on a low-rank factorization of a time-frequency transform. In particular, nonnegative matrix factorization (NMF) of the spectrogram – the (power) magnitude of the short-time Fourier transform (STFT) – has been considered in many audio applications. In this setting, NMF with the Itakura-Saito divergence was shown to underly a generative Ga...
متن کاملStatistical Energy Analysis and Finite Elements
SEA and FEA have become established engineering methods for noise and vibration analysis. They are contrasting approaches targeted at the high and low frequency ends of the analysis spectrum. This paper concerns the use of FE methods in SEA. Attention is focussed on two areas. The first concerns the use of FE models to predict SEA parameters, such as coupling loss factors. The second area conce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2022
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2022.111261